National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Alexander polynomial
Jančová, Ľubica ; Stanovský, David (advisor) ; Peksová, Lada (referee)
Title: Alexander polynomial Author: Ľubica Jančová Department: Department of Algebra Supervisor: doc. RNDr. David Stanovský, Ph.D., Department of Algebra Abstract: The subject of interest of this thesis is the Alexander polynomial in the knot theory as a knot invariant and various methods of its computa- tion. The thesis focuses on the description of the computation of the Alexander polynomial using four different methods, namely: colouring regions of the knot diagram, colouring arcs of the knot diagram, Seifert's method and the method using the Conway polynomial. In the first chapter we introduce basic notions of the knot theory. In the following chapters we describe methods of computa- tion of the Alexander polynomial. The final chapter deals with the possibility of using the Conway polynomial to show that all of the mentioned methods result in the same polynomial. The main result of this thesis are proofs that might lead to the complete proof of equivalence of algorithms of computation of the Alexander polynomial. Keywords: knot theory, Alexander polynomial, knot invariant
Jones polynomial
Gajdová, Anna ; Stanovský, David (advisor) ; Šťovíček, Jan (referee)
The topic of this thesis is the Jones polynomial of a given knot and its com- putation. First we define the Jones polynomial in two ways: using skein relations and using the bracket polynomial and we prove that these definitions are equi- valent. Next we derive an algorithm for computation of the Jones polynomial based on its relation with the bracket polynomial. We prove that the time com- plexity of the algorithm is O 20.823n , where n denotes number of crossings in a link diagram. Lastly we present the results of running the algorithm and its variants on data. We test the algorithm among others on small table knots, bigger random knots and on torus knots. We estimate that the fastest vari- ant of the algorithm runs on random knots with the average time complexity O 20.487n+o(n) . 1

Interested in being notified about new results for this query?
Subscribe to the RSS feed.